A variant of multi-task n-vehicle exploration problem: Maximizing every processor’s average profit
نویسندگان
چکیده
منابع مشابه
A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit
We discuss a variant of multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem asks all vehicles in a group to arrive at a same destination. It can also be viewed as to maximize every processor’s average profit, given n tasks, and each task’s consumetime and profit. Meanwhile, we propose a new kind of partition problem i...
متن کاملA Multi-vehicle Profit-maximizing Pickup and Delivery Selection Problem with Time Windows
Today the transportation market is highly competitive yet asymmetric. Large carriers enjoy market power from economies of scale and better networking. Small carriers rely on horizontal cooperation between each other to compete with, usually by trading on freight exchanges. One major challenge for small carriers is how to select requests so that the total profit from the delivery can be maximize...
متن کاملMatheuristics for a Multi-attribute Profit Collecting Vehicle Routing Problem
This paper studies a multi-attribute profit collecting vehicle routing problem, which arises in the collection operations of a charity organisation in the UK. The problem involves a heterogeneous fleet consisting of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maximum driving and working times, and partial collection...
متن کاملMulti-Attribute Profit-Maximizing Pricing
In the unlimited-supply profit-maximizing pricing problem, we are given the consumers’ consideration sets and know their purchase strategy (e.g. buy the cheapest items). The goal is to price the items to maximize the revenue. Previous studies suggest that this problem is too general to obtain even a sublinear approximation ratio (in terms of the number of items) even when the consumers are rest...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematicae Applicatae Sinica, English Series
سال: 2012
ISSN: 0168-9673,1618-3932
DOI: 10.1007/s10255-012-0162-6